Information processing apparatus and information processing method

ABSTRACT

An information processing apparatus is applied to a traffic mode where a plurality of users including a first user and a second user ride in an identical vehicle and travel, and the second user gets off the identical vehicle earlier than the first user. A controller is configured to execute: acquiring destination points of the first user and the second user; setting a predetermined area including the destination point of the first user and an area proximate to the destination point of the first user; determining whether the destination point of the second user is within or outside the predetermined area; and upon determining that the destination point of the second user is outside the predetermined area, setting a combination between the first user and the second user so that the first user and the second user are allowed to ride in the identical vehicle.

CROSS REFERENCE TO THE RELATED APPLICATION

This application is a Continuation of U.S. patent application Ser. No.16/435,848, filed Jun. 10, 2019, which claims the benefit of JapanesePatent Application No. 2018-117549, filed Jun. 21, 2018. Each of theprior applications is hereby incorporated by reference herein inentirety.

BACKGROUND Technical Field

The present disclosure relates to an information processing apparatusand an information processing method.

Description of the Related Art

Patent document 1 discloses a technique that calculates matching degreesbetween users using movement information and attribute information thatcorrespond to each user, and retrieves a passenger on the basis of thematching degree, in a traffic mode where users ride with each other in avehicle and travel.

CITATION LIST Patent Document

[Patent document 1] Japanese Patent Laid-Open No. 2014-146261

SUMMARY

The present disclosure has an object to provide an informationprocessing apparatus, an information processing method, and a programthat can set a combination beneficial for users riding in an identicalvehicle, in a traffic mode where the users ride in the identical vehicleand travel.

An information processing apparatus according to the present disclosuremay be an information processing apparatus applied to a traffic modewhere a plurality of users including a first user and a second user ridein an identical vehicle and travel, and the second user gets off theidentical vehicle earlier than the first user does. The informationprocessing apparatus may include a controller configured to execute:acquiring destination points of the first user and the second user inthe traffic mode; and setting a combination between the first user andthe second user allowed to ride in the identical vehicle so that thedestination point of the second user does not belong to a destinationarea that is a predetermined area including the destination point of thefirst user.

An information processing apparatus according to the present disclosuremay be an information processing apparatus applied to a traffic modewhere a plurality of users including a first user and a second user ridein an identical vehicle and travel, and the second user boards theidentical vehicle after the first user does. The information processingapparatus may include a controller configured to execute: acquiringdeparture points of the first user and the second user in the trafficmode; and setting a combination between the first user and the seconduser allowed to ride in the identical vehicle so that the departurepoint of the second user does not belong to a departure area that is apredetermined area including the departure point of the first user.

Furthermore, the present disclosure can be grasped from an aspect of aninformation processing method. For example, the present disclosure maybe an information processing method applied to a traffic mode where aplurality of users including a first user and a second user ride in anidentical vehicle and travel, and the second user gets off the identicalvehicle earlier than the first user does, causing a computer to execute:a step of acquiring destination points of the first user and the seconduser in the traffic mode; and a step of setting a combination betweenthe first user and the second user allowed to ride in the identicalvehicle so that the destination point of the second user does not belongto a destination area that is a predetermined area including thedestination point of the first user. The present disclosure may be aprogram for causing a computer to execute such an information processingmethod.

For example, the present disclosure may be an information processingmethod applied to a traffic mode where a plurality of users including afirst user and a second user ride in an identical vehicle and travel,and the second user boards the identical vehicle after the first userdoes, causing a computer to execute: a step of acquiring departurepoints of the first user and the second user in the traffic mode; and astep of setting a combination between the first user and the second userallowed to ride in the identical vehicle so that the departure point ofthe second user does not belong to a departure area that is apredetermined area including the departure point of the first user. Thepresent disclosure may be a non-transitory memory medium that stores aprogram for causing a computer to execute such an information processingmethod.

The present disclosure can set a combination beneficial for users ridingin the identical vehicle, in a traffic mode where the users ride in theidentical vehicle and travel.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a first diagram for illustrating a rideshare;

FIG. 2 is a second diagram for illustrating a rideshare;

FIG. 3 is a diagram depicting the schematic configuration of a matchingsystem according to a first embodiment;

FIG. 4 is a diagram exemplifying each of hardware configurations of afirst user terminal, a second user terminal, and a server apparatus inthe matching system;

FIG. 5 is a diagram exemplifying a functional configuration of theserver apparatus;

FIG. 6 depicts an example of a schedule information table;

FIG. 7 depicts an example of a request information table;

FIG. 8A exemplifies departure points and destination points of users(S001 and 5002) depicted in FIG. 6 and users (C001, C002 and C003)depicted in FIG. 7;

FIG. 8B is a first diagram for illustrating matching between a firstuser and a second user in a first embodiment;

FIG. 8C is a second diagram for illustrating matching between the firstuser and the second user in the first embodiment;

FIG. 9 depicts an example of a matching information table according tothe first embodiment;

FIG. 10 is a diagram exemplifying a flow of an operation of the matchingsystem according to the first embodiment;

FIG. 11 is a diagram depicting the schematic configuration of a matchingsystem according to a modification example 1 of the first embodiment;

FIG. 12 is a diagram exemplifying a flow of an operation of the matchingsystem according to the modification example 1 of the first embodiment;

FIG. 13 is a diagram exemplifying a matching information table accordingto the modification example 1 of the first embodiment;

FIG. 14 illustrates matching between the first user and the second userin the modification example 1 of the first embodiment;

FIG. 15 illustrates matching between the first user and the second userin a modification example 2 of the first embodiment;

FIG. 16A exemplifies the departure points and the destination points ofthe first user and the second user according to a second embodiment;

FIG. 16B is a first diagram for illustrating matching between the firstuser and the second user in the second embodiment; and

FIG. 16C is a second diagram for illustrating matching between the firstuser and the second user in the second embodiment.

DESCRIPTION OF THE EMBODIMENTS

An information processing apparatus according to the present disclosuremay be applied to a traffic mode where people ride in the identicalvehicle and travel. Here, the departure point and the destination pointof a customer user using such a traffic mode (hereinafter, simplyreferred to as “user”) are sometimes known to another user riding in theidentical vehicle; the departure point is a boarding point where theuser boards the vehicle, and the destination point is a descendingposition where the user gets off the vehicle.

For example, in a case where a first user and a second user ride in theidentical vehicle and travel and the second user gets off the vehicleearlier than the first user does, the destination point of the seconduser is known to the first user. For example, if the second user boardsthe vehicle after the first user in the case where the first user andthe second user ride in the identical vehicle and travel, the departurepoint of the second user is known to the first user.

Note that the first user and the second user are users who ride in theidentical vehicle and travel. The second user gets off the vehicleearlier than the first user does, or the second user boards the vehicleafter the first user does.

Here, the user uses the traffic mode with a predetermined purpose(commute, returning home, shopping, etc.). Consequently, the departurepoint and the destination point of each user tend to be included in theuser's range of activity. The user has much information (e.g., detailedgeographical information) about the area in his/her range of activity.Consequently, if the departure point or the destination point of thesecond user is included in the first user's range of activity associatedwith the departure point or the destination point of the first userriding in the identical vehicle, a situation can occur where the seconduser is afraid that his/her information (e.g., the zone of life) isknown to the first user.

A controller of the information processing apparatus according to thepresent disclosure may set the combination between the first user andthe second user allowed to ride in the identical vehicle so that thedestination point of the second user does not belong to a destinationarea that is a predetermined area including the destination point of thefirst user. Alternatively, or besides such setting, this controller mayset the combination between the first user and the second user to ridein the identical vehicle so that the departure point of the second userdoes not belong to a departure area that is a predetermined areaincluding the departure point of the first user. Here, for example, thedestination area may be an area having a distance that is from thedestination point of the first user and is equal to or less than apredetermined distance. Alternatively, for example, the departure areamay be an area having a distance that is from the departure point of thefirst user and is equal to or less than a predetermined distance. Notethat such a destination area and departure area are defined so as toinclude the range of activity of the first user.

According to the combination of users set as described above, thedestination point or the departure point of the second user is a pointoutside of the range of activity of the first user. Accordingly, it isdifficult for the first user to grasp detailed information related tothe destination point or the departure point of the second user. Inother words, the second user is facilitated to protect his/herinformation. This can prevent the second user from hesitating to use thetraffic mode described above as much as possible. The second user isfacilitated to use the traffic mode described above. As described above,the information processing apparatus according to the present disclosurecan set the combination beneficial for the users riding in the identicalvehicle.

<First Embodiment>

(Overview of Matching System)

FIG. 1 illustrates the traffic mode where multiple users ride in theidentical vehicle and travel. In FIG. 1, a user A and a user B departthe identical departure point c (the point c is, for example, the placeof work of the user A and the user B). The user A travels from thedeparture point c to the destination point e (the point e is, forexample, the residence of the user A), and the user B travels from thedeparture point c to a destination point d (the point d is, for example,the residence of the user B).

Here, if the users A and B separately move to the destination points byeach vehicle, two vehicles are to be used. On the contrary, if the usersA and B ride in the identical vehicle and travel, movement to thedestinations is allowed by one vehicle. In an example depicted in FIG.1, the user A serves as a driver of the vehicle, and moves the vehiclefrom the point c to the point e. In this case, the user A allows theuser B to ride in the vehicle at the departure point c, and allows theuser B to get off the vehicle at the point d, thereby enabling the userB to move from the point c to the point d.

As with FIG. 1, FIG. 2 also illustrates the traffic mode where peopleride in the identical vehicle and travel. In the example depicted inFIG. 2, the user A serves as the driver of the vehicle, and moves thevehicle from the point e (the point e is, for example, the residence ofthe user A) to the point c (the point c is, for example, the place ofwork of the user A and the user B). In this case, the user A allows theuser B to board the vehicle at the point d (the point d is, for example,the residence of the user B) and allows the user B to get off thevehicle at the point c.

Such traffic mode can reduce the number of vehicles traveling on roads,which can reduce traffic jams. Furthermore, for example, thetransportation cost (including the fuel cost etc.) used for movementusing a vehicle is shared and afforded (cost sharing) among the users ofthe vehicle, thereby allowing the transportation cost per user to bereduced in comparison with a case where the users separately move indifferent vehicles.

However, the information on the customer user using such a traffic mode(hereinafter, simply referred to as “user”) is sometimes known toanother user riding in the identical vehicle. For example, in a casewhere the point d is the residence of the user B in the examplesdepicted in FIGS. 1 and 2, the residence of the user B is known to theuser A. Accordingly, a situation can occur where the user who does notwish that the information, such as his/her own residence and zone oflife, is grasped in detail by another person hesitates to use thetraffic mode.

In the matching system according to this embodiment, the serverapparatus matches the first user with the second user. Note that thefirst user and the second user are users who ride in the identicalvehicle and travel, and the second user gets off the vehicle earlierthan the first user does. In detail, the server apparatus sets thecombination between the first user and the second user allowed to ridein the identical vehicle so that the destination point of the seconduser does not belong to a destination area that is a predetermined areaincluding the destination point of the first user. That is, theapparatus matches the first user with the second user.

(System Configuration)

FIG. 3 is a diagram depicting the schematic configuration of thematching system according to this embodiment. In the example in FIG. 3,the matching system 1 includes a vehicle 10, a first user terminal 100that is a terminal owned by the first user who drives the vehicle 10, asecond user terminal 200 that is a terminal owned by the second userriding in the vehicle 10 that the first user drives, and a serverapparatus 300. The first user terminal 100, the second user terminal200, and the server apparatus 300 are connected to each other by anetwork N1.

The server apparatus 300 accepts registration of the information fromthe user using the traffic mode depicted in FIG. 1 (hereinafter, such atraffic mode is sometimes referred to as “rideshare”). Identificationinformation related to the user and information on the vehicle providedfor rideshare are registered in the server apparatus 300. The userrequesting a ride in any vehicle registered in the server apparatus 300can register information indicating a request for a ride (hereinafter,request information) using the user terminal. The user driving thevehicle provided for the rideshare registered in the server apparatus300 can register a traveling schedule (hereinafter, scheduleinformation) of the vehicle, using the user terminal. Note that the usercan register the information through an application installed in theuser terminal for using a rideshare service (hereinafter, sometimescalled “predetermined application”), for example. However, there is nointention of limitation to the mode of registering the information usingthe user terminal. The information may be registered using any terminalconnectable to the network N1 (a smartphone, a mobile phone, a tabletterminal, a personal information terminal, a wearable computer or thelike) or a personal computer (PC). The identification informationrelated to the user, and the information on the vehicle provided forrideshare are preliminarily registered by the predetermined application.

The server apparatus 300 then matches the first user with the seconduser on the basis of the request information and the scheduleinformation. In this case, the server apparatus 300 matches the firstuser with the second user so that the destination point of the seconduser does not belong to the destination area of the first user. FIG. 3depicts the thus matched first user and the second user. That is, FIG. 3depicts the first user and the second user matched with each other asdescribed above by the server apparatus 300 on the basis of the scheduleinformation registered by the first user using the first user terminal100 and of the request information registered by the second user usingthe second user terminal 200. The details of the matching process aredescribed later.

(Hardware Configurations)

FIG. 4 is a diagram exemplifying each of hardware configurations of thefirst user terminal 100, the second user terminal 200, and the serverapparatus 300.

First, the server apparatus 300 is described. The server apparatus 300has the configuration of a typical computer. The server apparatus 300includes a processor 301, a main memory unit 302, an auxiliary memoryunit 303, and a communication unit 304. These are connected to eachother by a bus. The main memory unit 302 and the auxiliary memory unit303 are computer-readable recording media. The hardware configuration ofthe computer is not limited to the example depicted in FIG. 4. Thecomponents may be appropriately omitted, replaced and added.

The server apparatus 300 causes the processor 301 to load a programstored in the recording medium into a work area of the main memory unit302 and execute the program, and to control each functional componentand the like through execution of the program, thereby allowing afunction satisfying a predetermined object to be achieved.

The processor 301 is, for example, a CPU (Central Processing Unit) or aDSP (Digital Signal Processor). The processor 301 controls the serverapparatus 300 to perform the operation of various information processes.The main memory unit 302 includes, for example, a RAM (Random AccessMemory) and a ROM (Read Only Memory). The auxiliary memory unit 303 is,for example, an EPROM (Erasable Programmable ROM), or a hard disk drive(HDD). The auxiliary memory unit 303 may include a removable medium,i.e., a removable recording medium. The removable medium is, forexample, a disk recording medium, such as a USB (Universal Serial Bus)memory or a CD (Compact Disc) or a DVD (Digital Versatile Disc).

The auxiliary memory unit 303 stores various programs, various dataitems and various tables, in the recording medium, in a readable andwritable manner. The auxiliary memory unit 303 stores an operatingsystem (OS), various programs, various tables, etc. The informationstored in the auxiliary memory unit 303 may be stored in the main memoryunit 302. Furthermore, the information stored in the main memory unit302 may be stored in the auxiliary memory unit 303.

The communication unit 304 is connected to another apparatus, andcontrols communication between the server apparatus 300 and the otherapparatus. The communication unit 304 is, for example, a LAN (Local AreaNetwork) interface board, or a wireless communication circuit forwireless communication. The LAN interface board or the wirelesscommunication circuit is connected to the network N1, such as theInternet, which is a public communication network.

A series of processes executed by the server apparatus 300 can beexecuted by hardware, but can be executed by software instead.

Next, the second user terminal 200 is described. The second userterminal 200 is, for example, a small computer, such as a smartphone, amobile phone, a tablet terminal, a personal information terminal, or awearable computer (a smartwatch etc.). Note that the second userterminal 200 may be a personal computer (PC) that is connected to theserver apparatus 300 via the network N1, such as the Internet, which isa public communication network.

The second user terminal 200 includes a processor 201, a main memoryunit 202, an auxiliary memory unit 203, a display unit 204, an inputunit 205, and a communication unit 206. The processor 201, the mainmemory unit 202, and the auxiliary memory unit 203 are analogous to theprocessor 301, the main memory unit 302, and the auxiliary memory unit303 of the server apparatus 300. Accordingly, the description thereof isomitted. The display unit 204 is, for example, a liquid crystal display(LCD), an Electroluminescence (EL) panel or the like. The input unit 205includes a touch panel, push buttons, etc. Furthermore, the input unit205 may include a camera allowing videos and images to be input, or anaudio input unit, such as a microphone. The communication unit 206 is,for example, a communication circuit for accessing the network N1 usinga mobile communication service (a telephone communication network, suchas of mobile phones, or wireless communication, such as WiFi) and forcommunicating with the server apparatus 300 and the like.

Next, the first user terminal 100 is described. As with the second userterminal 200, the first user terminal 100 includes a processor 101, amain memory unit 102, an auxiliary memory unit 103, a display unit 104,an input unit 105, and a communication unit 106. The processor 101, themain memory unit 102, the auxiliary memory unit 103, the display unit104, the input unit 105, and the communication unit 106 are analogousrespectively to the processor 201, the main memory unit 202, theauxiliary memory unit 203, the display unit 204, the input unit 205, andthe communication unit 206 of the second user terminal 200. Accordingly,the description thereof is omitted.

The network N1 is, for example, a worldwide public communicationnetwork, such as the Internet. A WAN (Wide Area Network) or anothercommunication network may be adopted. The network N1 may include atelephone communication network such as of mobile phones, and a wirelesscommunication network such as WiFi.

(Functional Configuration of Server Apparatus)

FIG. 5 is a diagram exemplifying a functional configuration of theserver apparatus 300. The server apparatus 300 includes, as functionalcomponents: a schedule information acquisition unit F310; a requestinformation acquisition unit F320; a matching processing unit F330; amatching information providing unit F340; a schedule informationdatabase D310; a request information database D320; and a matchinginformation database D330. The processor 301 of the server apparatus 300causes a computer program on the main memory unit 302 to execute theprocesses of the schedule information acquisition unit F310, the requestinformation acquisition unit F320, the matching processing unit F330,and the matching information providing unit F340. Note that any of thefunctional components or a part of the process thereof may be executedby a hardware circuit.

The schedule information database D310, the request information databaseD320, and the matching information database D330 are constructed throughmanagement of data stored in the auxiliary memory unit 303, themanagement being performed by a program of a database management system(DBMS) executed by the processor 301. The schedule information databaseD310, the request information database D320, and the matchinginformation database D330 are, for example, relational databases.

Note that any of the functional components of the server apparatus 300or a part of the process thereof may be executed by another computerconnected to the network N1. For example, the processes of the matchingprocessing unit F330, and the processes of the schedule informationacquisition unit F310, the request information acquisition unit F320 andthe matching information providing unit F340 may be executed separatelyby different computers.

The schedule information acquisition unit F310 acquires the scheduleinformation from the user driving the vehicle provided for rideshare.Note that the schedule information includes the departure point and thedestination point of the vehicle used for rideshare, that is, themovement schedule of the user driving the vehicle. The scheduleinformation acquisition unit F310 registers the schedule information inthe schedule information database D310.

Here, the schedule information database D310 is a database that storesthe schedule information. The schedule information database D310includes a schedule information table depicted in FIG. 6. Note thatinformation stored in the schedule information table is not limited tothe example depicted in FIG. 6. A field can be appropriately added,changed or removed.

The schedule information table depicted in FIG. 6 includes the fields ofthe user ID (driver ID), vehicle number, departure point, scheduleddeparture time and destination point. The driver ID is the ID foridentifying the driver, and is preliminarily associated with theidentification information (vehicle number) on the vehicle in the serverapparatus 300. Rideshare user information that includes the user ID ismanaged by an individual table. The table includes the user's contactdestination and the like. The contact destination is, for example, theuser's mobile phone number or email address.

In the example depicted in FIG. 6, a driver 5001 causes the vehicle todepart the departure point c at 18:00, and moves the vehicle toward thedestination point e (the destination point e is the residence of thedriver S001.). A driver S002 causes the vehicle to depart the departurepoint c at 18:00, and moves the vehicle toward the destination point f(the destination point f is the residence of the driver S002.).

Here, returning to the description of FIG. 5. The request informationacquisition unit F320 acquires the request information from the userrequesting a ride in any vehicle registered in the server apparatus 300.Note that the request information includes the departure point and thedestination point of the user requesting the ride. The requestinformation acquisition unit F320 registers the request information inthe request information database D320.

The request information database D320 is a database that stores therequest information. The request information database D320 includes arequest information table depicted in FIG. 7. Note that informationstored in the request information table is not limited to the exampledepicted in FIG. 7. A field can be appropriately added, changed orremoved.

The request information table depicted in FIG. 7 includes the fields ofthe user ID (passenger ID), departure point, desired departure time,destination point, scheduled arrival time. In the example depicted inFIG. 7, the passenger C001 desires to depart the departure point c at18:00, and reach the destination point g at 18:20 (the destination pointg is a predetermined point in a vicinity of the residence of thepassenger C001). The passenger C002 desires to depart the departurepoint c at 18:00 and reach the destination point d at 18:30 (thedestination point d is a predetermined point in a vicinity of theresidence of the passenger C002). The passenger C003 desires to departthe departure point c at 18:00 and reach the destination point h at18:20 (the destination point h is a predetermined point in a vicinity ofthe residence of the passenger C003).

Note that the user inputs the schedule information or the requestinformation into the user terminal (e.g., the first user terminal 100 orthe second user terminal 200), thereby transmitting the information fromthe user terminal to the server apparatus 300. In detail, the first userterminal 100 has a functional configuration of accepting input of theschedule information and transmitting the input information to theserver apparatus 300. The processor 101 of the first user terminal 100causes a computer program on the main memory unit 102 to execute aprocess of transmitting the schedule information input from the inputunit 105, to the server apparatus 300 via the communication unit 106.The second user terminal 200 has a functional configuration of acceptinginput of the request information and transmitting the input informationto the server apparatus 300. The processor 201 of the second userterminal 200 causes a computer program on the main memory unit 202 toexecute a process of transmitting the request information input from theinput unit 205, to the server apparatus 300 via the communication unit206. The schedule information acquisition unit F310 and the requestinformation acquisition unit F320 acquire the information transmittedfrom the user terminal.

Here, returning to the description of FIG. 5. The matching processingunit F330 matches the first user scheduled to drive the vehicle 10 withthe second user scheduled to ride in the vehicle 10 driven by the firstuser. As described above, in this embodiment, the second user gets offthe vehicle 10 earlier than the first user does. The matching processperformed by the matching processing unit F330 is described on the basisof FIGS. 8A to 8C. Note that the processor 301 executes the processes ofthe schedule information acquisition unit F310, the request informationacquisition unit F320, and the matching processing unit F330, therebyfunctioning as a control unit according to the present disclosure. Theserver apparatus 300 then functions as an information processingapparatus according to the present disclosure.

FIG. 8A exemplifies the departure points and destination points of theusers (S001 and S002) depicted in FIG. 6 and the users (C001, C002 andC003) depicted in FIG. 7. In this example, the matching processing unitF330 sets a second user allowed to ride in the vehicle 10 driven by theuser S001, who is a first user, and sets a second user allowed to ridein the vehicle 10 driven by the user S002, who is a first user.

Here, the matching processing unit F330 sets the combination between thefirst user and the second user allowed to ride in the identical vehicle10 so that the destination point of the second user does not belong to apredetermined area (destination area) including the destination point ofthe first user. Note that as depicted in FIGS. 8B and 8C, thedestination area in this example is an area having a distance that isfrom the destination point of the first user and is equal to or lessthan a predetermined distance r. Note that this embodiment has nointention of limitation thereto. The destination area may be in a townincluding the destination point, or in a predetermined administrativedistrict including the destination point.

Accordingly, the second user C002 has the destination point d relativelynear to the destination point e of the first user S001. Consequently, inthis example, the destination point d of the second user C002 belongs tothe destination area of the first user S001. The second user C001 hasthe destination point g relatively near to the destination point f ofthe first user S002. Consequently, in this example, the destinationpoint g of the second user C001 belongs to the destination area of thefirst user S002. On the other hand, the second user C001 has thedestination point g relatively far from the destination point e of thefirst user S001. Consequently, in this example, the destination point gof the second user C001 does not belong to the destination area of thefirst user S001. The second user C002 has the destination point drelatively far from the destination point f of the first user S002.Consequently, in this example, the destination point d of the seconduser C002 does not belong to the destination area of the first userS002.

In this case, the matching processing unit F330 matches the first userS001 with the second user C001. Accordingly, as depicted in FIG. 8B,while the first user 5001 moves the vehicle 10 from the own departurepoint c to the own destination point e, this user allows the second userC001 to board the vehicle at the point c, and allows the second userC001 to get off the vehicle at the point g, thus moving the second userC001 from the departure point c of this second user to the destinationpoint g of this second user.

The matching processing unit F330 matches the first user S002 with thesecond users C002 and C003. Accordingly, as depicted in FIG. 8C, whilethe first user S002 moves the vehicle 10 from the own departure point cto the own destination point f, this user allows the second users C002and C003 to board the vehicle at the point c, and allows the second userC003 to get off the vehicle at the point h, thus moving the second userC003 from the departure point c of this second user to the destinationpoint h of this second user, and allows the second user C002 to get offthe vehicle at the point d, thus moving the second user C002 from thedeparture point c of this second user to the destination point d of thissecond user.

Note that the predetermined distance r is defined on the basis of therange of activity of the first user. As with this embodiment, when thedestination point of the first user is the residence of the first user,the first user's range of activity from the destination point can begrasped as the first user's range of zone of life. In this case, thepredetermined distance r is, for example, the radius (5 to 10 km) of thezone of life by bicycle. However, there is no intention of limitationthereto. The predetermined distance r may be, for example, the radius (2to 5 km) of the zone of life by bicycle, or the radius (about 1 km) ofthe zone of life by foot.

For example, when the destination point of the first user is apredetermined commercial facility, the first user's range of activityfrom the destination point can be grasped as the range of the communityto which the commercial facility belongs.

Accordingly, the destination point of the second user is outside of therange of activity of the first user. Accordingly, it is difficult forthe first user to grasp detailed information related to the destinationpoint of the second user. In this embodiment, the destination point ofthe second user is a predetermined point in a vicinity of the residenceof the second user. Here, the predetermined point in the vicinity of theresidence is, for example, a predetermined point within a range with aradius of 300 m from the residence (a parking lot allowing parking at ashop or in a facility, a place allowing parking along a highway, etc.).Consequently, the residence of the second user is not known to the firstuser. The situation where the residence of the second user is identifiedby the first user from the geographical information on the vicinity ofthe destination point of this second user can be prevented as much aspossible. Note that there is no intention of limiting the destinationpoint of the second user to a predetermined point in the vicinity of theresidence of this second user. For example, the destination point of thesecond user may be the residence of this second user, or a predeterminedcommercial facility. In this case, the situation where information onthe zone of life or the like of the second user is grasped by the firstuser can be avoided. As described above, the second user is facilitatedto protect his/her own information.

After the matching processing unit F330 completes the matching betweenthe first user and the second user, this unit generates the matchinginformation and registers the information in the matching informationdatabase D330.

Here, the matching information database D330 is a database that storesthe matching information. The matching information database D330includes a matching information table depicted in FIG. 9. Note thatinformation stored in the matching information table is not limited tothe example depicted in FIG. 9. A field can be appropriately added,changed or removed.

The matching information table depicted in FIG. 9 includes the fields ofthe driver ID, the passenger ID, the vehicle number, the departurepoint, scheduled departure time, the passenger destination point, andthe driver destination point. In this example, as described withreference to FIGS. 8B and 8C, the first user S001 is matched with thesecond user C001, and the first user S002 is matched with the secondusers C002 and C003.

Such matching information is provided by the matching informationproviding unit F340 depicted in FIG. 5 for the first user and the seconduser.

(Flow of Processes)

The flow of operation of the matching system according to thisembodiment is described. FIG. 10 is a diagram exemplifying the flow ofoperation of the matching system according to this embodiment. FIG. 10illustrates the flow of operation between the components, and theprocess executed by each component, in the matching system 1.

The first user terminal 100 accepts the schedule information from thefirst user (S101), and transmits the information to the server apparatus300 (S102).

The server apparatus 300 then acquires the schedule informationtransmitted from the first user terminal 100, through reception by thecommunication unit 304, and registers the schedule information in theschedule information database D310 (S103). Here, the scheduleinformation includes the destination point of the first user. That is,the process of S103 is a step of acquiring the destination point of thefirst user.

The second user terminal 200 accepts the request information from thesecond user (S104), and transmits the information to the serverapparatus 300 (S105).

The server apparatus 300 then acquires the request informationtransmitted from the second user terminal 200, through reception by thecommunication unit 304, and registers the request information in therequest information database D320 (S106). Here, the request informationincludes the destination point of the second user. That is, the processof 5106 is a step of acquiring the destination point of the second user.

The server apparatus 300 performs the matching process on the basis ofthe schedule information and the request information (S107). Asdescribed above, the matching processing unit F330 of the serverapparatus 300 sets the combination between the first user and the seconduser allowed to ride in the identical vehicle 10 so that the destinationpoint of the second user does not belong to the destination area of thefirst user. After completion of the matching process, the serverapparatus 300 registers the matching information in the matchinginformation database D330 (S108). Furthermore, the server apparatus 300transmits the matching information registered in the matchinginformation database D330 to the first user terminal 100 and the seconduser terminal 200 (S109 and S111).

The first user terminal 100 and the second user terminal 200 acquire thematching information transmitted from the server apparatus 300 (S110 andS112).

The matching system described above prevents a situation where thesecond user hesitates to use the rideshare, as much as possible, andfacilitates the second user to use the rideshare. As described above,the information processing apparatus according to the present disclosurecan set the combination beneficial for the users riding in the identicalvehicle 10.

(Recording Medium)

A program that allows a computer, another machine or an apparatus(hereinafter a computer or the like) to achieve any of the functionsdescribed above can be recorded in a recording medium that is readableby the computer or the like. The computer or the like is caused to readand perform the program in the recording medium, thereby enabling thefunction to be provided.

Here, the recording medium that is readable by the computer or the likeis a non-transitory recording medium that can accumulate information,such as data or programs, through an electric, a magnetic, an optical, amechanical or a chemical action, and read it from the computer or thelike. What is detachable from the computer or the like among suchrecording media includes, for example, a flexible disk, magnetoopticaldisk, CD-ROM, CD-R/W, DVD, blu-ray disk, DAT, 8 mm tape, and a memorycard, such as a flash memory. Furthermore, there is a hard disk, ROM(read only memory) and the like as recording media fixed to the computeror the like. Moreover, an SSD (Solid State Drive) can be used as arecording medium detachable from the computer or the like and also as arecording medium fixed to the computer or the like.

<Modification Example 1 of First Embodiment>

Next, a modification example 1 of the aforementioned first embodiment isdescribed. Note that in this modification example, detailed descriptionof components and control processes substantially identical to those inthe first embodiment is omitted.

In the aforementioned first embodiment, as described with reference toFIG. 3, the first user drives the vehicle 10, and allows the second userto ride in the vehicle 10. On the other hand, in this modificationexample, the drive user drives the vehicle 10 and allows the first userand the second user to ride in the vehicle 10. This is described basedon FIGS. 11 to 14.

FIG. 11 is a diagram depicting the schematic configuration of thematching system according to this modification example. In the examplein FIG. 11, the matching system 1 includes: the vehicle 10; a drive userterminal 400 that is a terminal owned by the drive user driving thevehicle 10; a first user terminal 100 that is a terminal owned by thefirst user riding in the vehicle 10 that the drive user drives; a seconduser terminal 200 that is a terminal owned by the second user riding inthe vehicle 10 that the drive user drives; and the server apparatus 300.The first user terminal 100, the second user terminal 200, the serverapparatus 300, and the drive user terminal 400 are connected to eachother by a network N1.

As described in the first embodiment, the first user and the second userare users who ride in the identical vehicle 10 and travel, and thesecond user gets off the vehicle 10 earlier than the first user does. Inthis modification example, the functional configuration of the firstuser terminal 100 is substantially identical to the functionalconfiguration of the second user terminal 200. The functionalconfiguration of the drive user terminal 400 is substantially identicalto the functional configuration of the first user terminal 100 describedin the first embodiment.

FIG. 12 is a diagram exemplifying a flow of an operation of the matchingsystem according to this modification example. In this modificationexample, the drive user terminal 400 accepts the schedule informationfrom the drive user (S101), and transmits the information to the serverapparatus 300 (S102). In an analogous manner where the second userterminal 200 accepts the request information from the second user (S104)and transmits the information to the server apparatus 300 (S105), thefirst user terminal 100 accepts the request information from the firstuser (S104) and transmits the information to the server apparatus 300(S105).

The server apparatus 300 then performs the matching process on the basisof the request information (S107). As described above, the matchingprocessing unit F330 of the server apparatus 300 sets the combinationbetween the first user and the second user allowed to ride in theidentical vehicle 10 so that the destination point of the second userdoes not belong to the destination area of the first user.

Here, FIG. 13 depicts the matching information table in thismodification example. The passengers C001 and C002 depicted in FIG. 13are the same as the passengers C001 and C002 depicted in FIG. 7described above. In this modification example, the passenger C002corresponds to the first user, and the passenger C001 corresponds to thesecond user. This is described based on FIG. 14.

FIG. 14 illustrates matching between the first user and the second userin this modification example. In FIG. 14, while the drive user S003moves the vehicle 10 from the own departure point c to the owndestination point i, this user allows the first user C002 and the seconduser C001 to board the vehicle at the point c, and allows the seconduser C001 to get off the vehicle at the point g, thus moving the seconduser C001 from the departure point c of this second user to thedestination point g of this second user, and allows the first user C002to get off the vehicle at the point d, thus moving the first user C002from the departure point c of this first user to the destination point dof this first user. Accordingly, the destination point of the seconduser is outside of the range of activity of the first user, and thesecond user is facilitated to protect the own information.

The matching system described above also can set the combinationbeneficial for the users riding in the identical vehicle 10.

Note that the aforementioned matching system depicted in FIG. 11includes the drive user terminal 400, which is a terminal owned by thedrive user driving the vehicle 10. However, there is no intention oflimitation thereto. For example, the vehicle 10 may be an autonomousmobile body that autonomously moves on the basis of a predeterminedoperation instruction. In this case, there is no drive user.Accordingly, the server apparatus 300 acquires the drive schedule of thevehicle 10 (schedule information) from a predetermined operationmanagement server.

<Modification Example 2 of First Embodiment>

Next, a modification example 2 of the aforementioned first embodiment isdescribed. Note that in this modification example, detailed descriptionof components and control processes substantially identical to those inthe first embodiment is omitted.

As described in the first embodiment, the first user S001 driving thevehicle 10 moves the vehicle 10, with the own residence e being adoptedas the destination point. Here, in a case where the departure point c ofthe vehicle 10 is the place of work of the first user S001, the firstuser S001 tends to move the vehicle 10 from the point c to the point ealong a determined route. In this modification example, the serverapparatus 300 stores the thus determined route, and matches the seconduser whose destination point does not belong to the route. This isdescribed based on FIG. 15.

FIG. 15 illustrates matching between the first user and the second userin this modification example. In FIG. 15, typically, the first user S001moves the vehicle 10 from the departure point c to the destination pointe along the determined route L1. In this case, the first user S001 hassometimes much information (e.g., detailed geographical information)also around the route L1 besides the destination area. Consequently, ifthe destination point of the second user belongs to the route L1,inconvenience for the second user can occur.

As depicted in FIG. 15, in this modification example, the first userS001 is matched with the second user whose destination point is j. Inthis case, the first user S001 moves the vehicle 10 along a route L2,for example. Consequently, the first user S001 is difficult to graspdetailed information related to the destination point of the seconduser. As described above, the second user is facilitated to protecthis/her own information. That is, such a matching system also can setthe combination beneficial for the users riding in the identical vehicle10.

<Second Embodiment>

Next, a second embodiment of the present disclosure is described. Notethat in this embodiment, detailed description of components and controlprocesses substantially identical to those in the aforementioned firstembodiment is omitted.

In the first embodiment described above, the server apparatus 300 setsthe combination between the first user and the second user allowed toride in the identical vehicle 10 so that the destination point of thesecond user does not belong to the destination area that is apredetermined area including the destination point of the first user. Onthe other hand, in this embodiment, the server apparatus 300 sets thecombination between the first user and the second user allowed to ridein the identical vehicle 10 so that the departure point of the seconduser does not belong to the departure area that is a predetermined areaincluding the departure point of the first user. This is described basedon FIGS. 16A to 16C.

FIG. 16A exemplifies the departure points and the destination points ofthe first user and the second user. In FIG. 16A, the first user S001serving as a driver moves the vehicle 10 from the departure point e tothe destination point c. The first user S002 serving as a driver movesthe vehicle 10 from the departure point f to the destination point c.The departure points of the second users riding in the vehicle 10 are d,g and h. In detail, the departure point of the second user C001 is g,the departure point of the second user C002 is d, and the departurepoint of the second user C003 is h. Note that the destination point ofthese second users is c, as with the destination point of the firstusers. As depicted in FIGS. 16B and 16C, the departure area in thisexample is an area having a distance that is from the departure point ofthe first user and is equal to or less than the predetermined distancer. Note that this embodiment has no intention of limitation thereto. Thedeparture area may be in a town including the departure point, or in apredetermined administrative district including the departure point.

Accordingly, the second user C002 has the departure point d relativelynear to the departure point e of the first user S001. Consequently, inthis example, the departure point d of the second user C002 belongs tothe departure area of the first user S001. The second user C001 has thedeparture point g relatively near to the departure point f of the firstuser S002. Consequently, in this example, the departure point g of thesecond user C001 belongs to the departure area of the first user S002.On the other hand, the second user C001 has the departure point grelatively far from the departure point e of the first user S001.Consequently, in this example, the departure point g of the second userC001 does not belong to the departure area of the first user S001. Thesecond user C002 has the departure point d relatively far from thedeparture point f of the first user S002. Consequently, in this example,the departure point d of the second user C002 does not belong to thedeparture area of the first user S002.

In this case, the matching processing unit F330 matches the first userS001 with the second user C001. Accordingly, as depicted in FIG. 16B,while the first user S001 moves the vehicle 10 from the own departurepoint e to the own destination point c, this user allows the second userC001 to board the vehicle at the point g, and allows the second userC001 to get off the vehicle at the point c, thus moving the second userC001 from the departure point g of this second user to the destinationpoint c of this second user.

The matching processing unit F330 matches the first user S002 with thesecond users C002 and C003. Accordingly, as depicted in FIG. 16C, whilethe first user S002 moves the vehicle 10 from the own departure point fto the own destination point c, this user allows the second user C002 toboard the vehicle at the point d, allows the second user C003 to boardthe vehicle at the point h, and allows the second users C002 and C003 toget off the vehicle at the point c.

In this embodiment, in the flow of the operation depicted in FIG. 10described above, the departure point of the first user is acquired inthe process of S103, and the departure point of the second user isacquired in the process of S106. In the process of S107, the combinationbetween the first user and the second user allowed to ride in theidentical vehicle 10 so that the departure point of the second user doesnot belong to the departure area of the first user.

Accordingly, the departure point of the second user is outside of therange of activity of the first user. Accordingly, it is difficult forthe first user to grasp detailed information related to the departurepoint of the second user. Consequently, the second user is facilitatedto protect his/her own information.

If the second user can grasp the position information on the vehicle 10where this user is scheduled to board, before boarding the vehicle 10,and the first user and the second user having relatively near departurepoints are matched with each other, information on the first user's zoneof life and the like is grasped by the second user.

On the contrary, in this embodiment, the departure point of the seconduser is outside of the departure area of the first user. That is, thedeparture point of the first user and the departure point of the seconduser are relatively far from each other. Consequently, it is difficultfor the second user to grasp the detailed information related to thedeparture point of the first user.

The matching system described above prevents a situation where thesecond user hesitates to use the rideshare, as much as possible, andfacilitates the second user to use the rideshare. As described above,the information processing apparatus according to the present disclosurecan set the combination beneficial for the users riding in the identicalvehicle 10.

Note that in FIGS. 16A to 16C, both of the destination point of thefirst user and the destination point of the second user are the point c.In FIGS. 16A to 16C, the destination point of the first user and thedestination point of the second user may, however, be different fromeach other. In this case, as described in the first embodiment, thematching processing unit F330 may set the combination between the firstuser and the second user allowed to ride in the identical vehicle 10 sothat the destination point of the second user does not belong to thedestination area of the first user.

<Third Embodiment>

Next, a third embodiment of the present disclosure is described. Notethat in this embodiment, detailed description of components and controlprocesses substantially identical to those in the aforementioned firstembodiment is omitted.

In the first embodiment described above, the server apparatus 300 setsthe combination between the first user and the second user allowed toride in the identical vehicle 10 so that the destination point of thesecond user does not belong to the destination area of the first user.Accordingly, the destination point of the second user is outside of therange of activity of the first user, and the second user is facilitatedto protect the own information. However, if the first user repetitivelydrives in a predetermined area (the driving includes not only a casewhere the first user serves as a driver of the vehicle 10 and drives butalso a case where the first user serves as a passenger of the vehicle 10for the driving), the first user can have much information (e.g.,detailed geographical information) on the predetermined area even withthe predetermined area being outside of the range of activity of thefirst user. If the destination point of the second user is included inthe predetermined area, a situation can occur where the second user isafraid that the second user's information (e.g., the zone of life) isknown to the first user.

In this embodiment, the server apparatus 300 sets the combinationbetween the first user and the second user allowed to ride in theidentical vehicle 10 so as not to repeat the combination between thefirst user and the second user having previously ridden in the identicalvehicle 10. This is hereinafter described.

As described for the flow of the operation depicted in FIG. 10, theserver apparatus 300 registers the matching information in the matchinginformation database D330 (S108). In this embodiment, the aforementionedcombination information between the first user and the second user asdepicted in FIG. 9 is accumulated and stored in the auxiliary memoryunit 303 of the server apparatus 300. That is, the server apparatus 300stores the combination between the first user and the second user havingpreviously ridden in the identical vehicle 10.

In this embodiment, when the matching processing unit F330 matches thefirst user with the second user, the matching processing unit F330 setsthe combination between the first user and the second user allowed toride in the identical vehicle 10 so that the destination point of thesecond user does not belong to the destination area of the first user,and sets the combination between the first user and the second userallowed to ride in the identical vehicle 10 so as not to repeat thecombination between the first user and the second user having previouslyridden in the identical vehicle 10.

Accordingly, it is difficult for the first user to grasp detailedinformation related to the destination point of the second user. Inother words, the second user is facilitated to protect his/her owninformation. Accordingly, the second user is facilitated to use therideshare. As described above, also according to this embodiment, thecombination beneficial for the users riding in the identical vehicle 10can be set.

<Other Embodiments>

The embodiments described above are only examples. The presentdisclosure can be appropriately changed and executed in a scope withoutdeparting from the gist.

The matching system according to this embodiment is not limited to theapplication to rideshare as described above and, for example, may beused for a case of matching a taxi driver with a customer.

The processes and means described in this disclosure can be freelycombined and executed unless a technical contradiction occurs.

The process described as what is performed by a single device may beshared among multiple devices and executed. Alternatively, the processesdescribed as what is performed by different devices may be executed by asingle device. In a computer system, a hardware configuration (serverconfiguration) that executes each function can be flexibly changed.

The present disclosure can be also achieved by providing a computer witha computer program where the functions described in the embodiments areimplemented, and by causing one or more processors included in thecomputer to read and execute the program. Such a computer program may beprovided for the computer through a non-transitory computer readablestorage medium connectable to a system bus of the computer, or providedfor the computer via a network. The non-transitory computer readablestorage medium may be, for example, any type of disk, such as a magneticdisk (floppy (R) disk, hard disk drive (HDD), etc.) or an optical disk(CD-ROM, DVD disk, blu-ray disk, etc.), or a read only memory (ROM), arandom access memory (RAM), EPROM, EEPROM, a magnetic card, a flashmemory or an optical card, or any type of medium suitable for storingelectronic instructions.

What is claimed is:
 1. An information processing apparatus applied to atraffic mode where a plurality of users including a first user and asecond user ride in an identical vehicle and travel, and the second usergets off the identical vehicle earlier than the first user does,comprising a controller configured to execute: acquiring destinationpoints of the first user and the second user in the traffic mode;setting a predetermined area including the destination point of thefirst user and an area proximate to the destination point of the firstuser; determining whether the destination point of the second user iswithin or outside the predetermined area; and upon determining that thedestination point of the second user is outside the predetermined area,setting a combination between the first user and the second user so thatthe first user and the second user are allowed to ride in the identicalvehicle.
 2. The information processing apparatus according to claim 1,wherein the predetermined area is an area within a predetermineddistance from the destination point of the first user.
 3. Theinformation processing apparatus according to claim 1, wherein thedestination point of the second user is a predetermined point in avicinity of a residence of the second user.
 4. An information processingapparatus applied to a traffic mode where a plurality of users includinga first user and a second user ride in an identical vehicle and travel,and the second user boards the identical vehicle after the first userdoes, comprising a controller configured to execute: acquiring departurepoints of the first user and the second user in the traffic mode;setting a predetermined area including the departure point of the firstuser and an area proximate to the departure point of the first user;determining whether the departure point of the second user is within oroutside the predetermined area; and upon determining that the departurepoint of the second user is outside the predetermined area, setting acombination between the first user and the second user so that the firstuser and the second user are allowed to ride in the identical vehicle.5. The information processing apparatus according to claim 4, whereinthe predetermined area is an area having a distance that is equal to orless than a predetermined distance from the departure point of the firstuser.
 6. The information processing apparatus according to claim 4,wherein the departure point of the second user is a predetermined pointin a vicinity of a residence of the second user.
 7. The informationprocessing apparatus according to claim 1, wherein in the traffic mode,the second user boards the identical vehicle after the first user does,and gets off the identical vehicle earlier than the first user does, andthe controller executes: further acquiring departure points of the firstuser and the second user in the traffic mode; setting anotherpredetermined area including the departure point of the first user andan area proximate to the departure point of the first user; determiningwhether the departure point of the second user is within or outside theanother predetermined area; and upon determining that the departurepoint of the second user is outside the another predetermined area,setting the combination between the first user and the second user sothat the first user and the second user are allowed to ride in theidentical vehicle.
 8. The information processing apparatus according toclaim 1, wherein the controller sets the combination between the firstuser and the second user who are allowed to ride in the identicalvehicle so as not to repeat the combination between the first user andthe second user having previously ridden in the identical vehicle. 9.The information processing apparatus according to claim 4, wherein thecontroller sets the combination between the first user and the seconduser who are allowed to ride in the identical vehicle so as not torepeat the combination between the first user and the second user havingpreviously ridden in the identical vehicle.
 10. An informationprocessing method applied to a traffic mode where a plurality of usersincluding a first user and a second user ride in an identical vehicleand travel, and the second user gets off the identical vehicle earlierthan the first user does, the information processing method causing acomputer to execute: a step of acquiring destination points of the firstuser and the second user in the traffic mode; a step of setting apredetermined area including the destination point of the first user andan area proximate to the destination point of the first user; a step ofdetermining whether the destination point of the second user is withinor outside the predetermined area; and a step of, upon determining thatthe destination point of the second user is outside the predeterminedarea, setting a combination between the first user and the second userso that the first user and the second user are allowed to ride in theidentical vehicle.
 11. A non-transitory memory medium stored with aprogram for causing a computer to execute the information processingmethod according to claim
 10. 12. An information processing methodapplied to a traffic mode where a plurality of users including a firstuser and a second user ride in an identical vehicle and travel, and thesecond user boards the identical vehicle after the first user does, theinformation processing method causing a computer to execute: a step ofacquiring departure points of the first user and the second user in thetraffic mode; a step of setting a predetermined area including thedeparture point of the first user and an area proximate to the departurepoint of the first user; a step of determining whether the departurepoint of the second user is within or outside the predetermined area;and a step of, upon determining that the departure point of the seconduser is outside the predetermined area, setting a combination betweenthe first user and the second user so that the first user and the seconduser are allowed to ride in the identical vehicle.
 13. A non-transitorymemory medium storing a program for causing a computer to execute theinformation processing method according to claim 12.